Constraint Programming in Java with JSolver

نویسندگان

  • Andy Hon
  • Wai Chun
چکیده

This paper describes our progress in designing and developing a Java constraint programming class library called JSolver2. JSolver extends the object-oriented programming paradigm of Java with constraint-based declarative programming. Other constraint-based Java tools act as pre-processors to Java. JSolver, on the other hand, is implemented as a set of pure Java classes and allows direct development of constraint-based applications within a Java environment. Constraint programming tools like JSolver allow server-side development of scheduling and resource management systems in Java and deployment of these systems over the Web. JSolver permits interactive and dynamic constraint-based applications to be built, which is not possible with previous pre-processor approaches. This paper uses an extended example of a simplified airport bay allocation system – Micro-BAS, to illustrate the facilities provided by JSolver.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Waltz Filtering in Java with JSolver

This paper uses the Waltz Filtering Algorithm and the Line-Labelling Problem to illustrate how AI algorithms can easily be implemented using Java and JSolver2 – a constraint-programming class library. The Waltz Filtering Algorithm popularised the technique of constraint propagation – the cornerstone for algorithms to solve constraint-satisfaction problems (CSP). It was initially developed as a ...

متن کامل

Comparing Mixed-Integer and Constraint Programming for the No-Wait Flow Shop Problem with Due Date Constraints

The impetus for this research was examining a flow shop problem in which tasks were expected to be successively carried out with no time interval (i.e., no wait time) between them. For this reason, they should be completed by specific dates or deadlines. In this regard, the efficiency of the models was evaluated based on makespan. To solve the NP-Hard problem, we developed two mathematical mode...

متن کامل

DJ: A Java-based Constraint Language and System

DJ (Declarative Java) is an extension of Java that supports constraint programming. With DJ, users do not need to learn the complicated class hierarchy of the AWT package or Java's layout managers. To construct a GUI, users only need to specify the components that compose the GUI and the relationship among the components by using constraints. As a constraint language, DJ can be used not only to...

متن کامل

Convex Generalized Semi-Infinite Programming Problems with Constraint Sets: Necessary Conditions

 We consider generalized semi-infinite programming problems in which the index set of the inequality constraints depends on the decision vector and all emerging functions are assumed to be convex. Considering a lower level constraint qualification, we derive a formula for estimating the subdifferential of the value function. Finally, we establish the Fritz-John necessary optimality con...

متن کامل

Multi-item inventory model with probabilistic demand function under permissible delay in payment and fuzzy-stochastic budget constraint: A signomial geometric programming method

This study proposes a new multi-item inventory model with hybrid cost parameters under a fuzzy-stochastic constraint and permissible delay in payment. The price and marketing expenditure dependent stochastic demand and the demand dependent the unit production cost are considered. Shortages are allowed and partially backordered. The main objective of this paper is to determine selling price, mar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999